Mersenne Lucas numbers and complete homogeneous symmetric functions
نویسندگان
چکیده
منابع مشابه
Mersenne and Fermat Numbers
The first seventeen even perfect numbers are therefore obtained by substituting these values of ra in the expression 2n_1(2n —1). The first twelve of the Mersenne primes have been known since 1914; the twelfth, 2127 —1, was indeed found by Lucas as early as 1876, and for the next seventy-five years was the largest known prime. More details on the history of the Mersenne numbers may be found in ...
متن کاملRibbons and Homogeneous Symmetric Functions
We demonstrate an elegant combinatorial formula for the operation which adds a column on the homogeneous symmetric functions when this function acts on the Schur basis. A q-analog of this formula adds a column on the Hall-Littlewood basis. Résumé. Nous demontrons une formule élégante et combinatoire pour l’opérateur qui ajoute une colonne sur les fonctions symétriques homogène quand cet opérate...
متن کاملGeneralised Mersenne Numbers Revisited
Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attractive choice for modular multiplication implementation. However, the issue of residue multiplication efficiency seems to have been overlooked....
متن کاملLucas-sierpiński and Lucas-riesel Numbers
In this paper, we show that there are infinitely many Sierpiński numbers in the sequence of Lucas numbers. We also show that there are infinitely many Riesel numbers in the sequence of Lucas numbers. Finally, we show that there are infinitely many Lucas numbers that are not a sum of two prime powers.
متن کاملEquations Involving Arithmetic Functions of Fibonacci and Lucas Numbers
For any positive integer k, let (k) and a(k) be the number of positive integers less than or equal to k and relatively prime to k and the sum of divisors ofk, respectively. In [6] we have shown that 0(Fn) > F^n) and that a(Fn) < Fa{ri) and we have also determined all the cases in which the above inequalities become equalities. A more general inequality of this type was proved in [7]. In [8] ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Computer Science
سال: 2021
ISSN: 2008-949X
DOI: 10.22436/jmcs.024.02.04